Multi-Objective Parallel Machine Scheduling with Eligibility Constraints for the Kitting of Metal Structural Parts
نویسندگان
چکیده
This paper studied a class of coupling problems material assignment, part nesting, kit delivery and parallel machine scheduling. The aim this was to solve the scheduling problem metal structural processing welding assembly with eligibility constraints. A two-stage mixed-integer programming model constructed. constraints took into account type parts nesting. objectives were minimize makespan, maximize utilization metrics (kitting time numbers earliness tardiness kits). hierarchical optimization approach proposed. solved by using Gurobi solver in first stage, results used constrain second stage. stage an improved multi-objective genetic algorithm. Due strong relationships among sorting parts, each profile material, hybrid encoding decoding mode designed for Finally, proposed applied actual production cases. data showed that when number components exceeded 300 (the about 1500), reached 95%. Choosing suitable machines, 90%. demonstrated effectiveness
منابع مشابه
Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملscheduling of unrelated parallel machines using two multi objective genetic algorithms with sequence-dependent setup times and precedent constraints
abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...
متن کاملHeuristics for Unrelated Parallel Machine Scheduling with Secondary Resource Constraints
This research deals with the problem of scheduling N jobs on M unrelated parallel machines. Each job has a due date and requires a single operation. A setup that includes detaching one die and attaching another from the appropriate die type is incurred if the type of the job scheduled is different from the last job on that machine. Due to the mechanical structure of machines and the fitness of ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملExperiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling
Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machines
سال: 2022
ISSN: ['2075-1702']
DOI: https://doi.org/10.3390/machines10100836